Optimisation models for train timetabling and marshalling yard planning
نویسندگان
چکیده
منابع مشابه
The train marshalling problem
The problem considered in this paper arose in connection with the rearrangement of railroad cars in China. In terms of sequences the problem reads as follows: contains all the elements of S p(1) , then all elements of S p(2) , : : :, etc., and nally all elements of S p(t). The aim of this paper is to show that the decision problem: \Given numbers n; k and a partition S of f1; 2; :::; ng, is K (...
متن کاملRBSIM- simulation model of marshalling yard operation
This paper deals with a simulation model of technological procedures in a marshalling yard. The structure of the model and its properties are described from the point of view of a user. Attention is paid namely to its flexibility and built in capacities of cooperative solution of problems during the simulation run.
متن کاملOptimisation of simultaneous train formation and car sorting at marshalling yards∗
Efficient and correct freight train marshalling is vital for high quality carload freight transportations. During marshalling, it is desirable that cars are sorted according to their individual drop-off locations in the outbound freight trains. Furthermore, practical limitations such as non-uniform and limited track lengths and the arrival and departure times of trains need to be considered. Th...
متن کاملProfile Guided Code Optimisation of Marshalling Routines
The marshalling operation has often been identified as a performance bottleneck for high-speed network applications. In this paper, we propose the use of profile guided code generation of marshalling routines in order to better adapt performance optimisations of marshalling routines to the requirements of a specific application. We motivate this approach with a detailed case study and measureme...
متن کاملTrain Marshalling Is Fixed Parameter Tractable
The train marshalling problem is about reordering the cars of a train using as few auxiliary rails as possible. The problem is known to be NP-complete. We show that it is fixed parameter tractable (FPT) with the number of auxiliary rails as parameter.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linköping studies in science and technology
سال: 2022
ISSN: ['0345-7524']
DOI: https://doi.org/10.3384/9789179292560